#define _CRT_SECURE_NO_WARNINGS 1

#include "Sort.h"

void PrintfArray(int* a,int n) {
	for (int i = 0; i < n; i++) {
		printf("%d ", a[i]);
	}
	printf("\n");
}


int main() {
	int a[] = { 3,2,3,7,6,1,4,5,11,9};
	//InsertSort(a, sizeof(a) / sizeof(a[0]));
	//PrintfArray(a, sizeof(a) / sizeof(a[0]));

	//ShellSort(a, sizeof(a) / sizeof(a[0]));
	//PrintfArray(a, sizeof(a) / sizeof(a[0]));

	//QuickSort(a, 0, sizeof(a) / sizeof(a[0])-1);
	//PrintfArray(a, sizeof(a) / sizeof(a[0]));

	//MergeSort(a,sizeof(a) / sizeof(a[0]));
	//PrintfArray(a, sizeof(a) / sizeof(a[0]));

	//QuickSortNonR(a, 0, sizeof(a) / sizeof(a[0]) - 1);
	//PrintfArray(a, sizeof(a) / sizeof(a[0]));

	//BubbleSort(a, sizeof(a) / sizeof(a[0]));
	//PrintfArray(a, sizeof(a) / sizeof(a[0]));

	//SelectSort(a, sizeof(a) / sizeof(a[0]));
	//PrintfArray(a, sizeof(a) / sizeof(a[0]));

	//MergeSortNonR(a,sizeof(a) / sizeof(a[0]));
	//PrintfArray(a, sizeof(a) / sizeof(a[0]));

	//CountSort(a, sizeof(a) / sizeof(a[0]));
	//PrintfArray(a, sizeof(a) / sizeof(a[0]));
	return 0;
}